Batch Mutually Referenced Separation Algorithm for MIMO Convolutive Mixtures

نویسنده

  • Ali Mansour
چکیده

This paper deals with the blind separation problem of MultiInput Multi-Output (MIMO) convolutive mixtures. Previously, we presented some algorithms based on mutually referenced criterion to separate MIMO convolutive mixtures. However, the proposed algorithms are time consuming and they need a lot of computation efforts. It is obvious that the computation efforts can be reduced as well the convergence time when the adaptive algorithms are well initialized. To choose the best starting point of these algorithms, we propose here a direct and batch minimization of the proposed criteria.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Blind Separation of Convolutive Mixtures a Contrast-based Joint Diagonalization Approach

Blind Separation of convolutive mixtures and Blind Equalization of Multiple-Input Multiple-Output (MIMO) channels are two different ways of naming the same problem, which we address here. The numerical algorithm, subsequently presented in detail, is based on theoretical results on contrasts recently published by the authors [1]. This algorithm consists of Partial Approximate Joint Diagonalizati...

متن کامل

Residual Cross-talk and Noise Suppression for Convolutive Blind Source Separation

Introduction Blind source separation (BSS) refers to the problem of recovering signals from several observed linear mixtures (e.g., [1]). In this paper we deal with the convolutive mixing case as encountered, e.g., in acoustic environments, and aim at finding a corresponding demixing system, whose output signals yq(n), q = 1, . . . , P are described by yq(n) = ∑P p=1 ∑L−1 κ=0 wpq,κxp(n−κ), and ...

متن کامل

Blind Source Separation Algorithm for Mimo Convolutive Mixtures

We consider the problem of blind source separation of MIMO convolutive mixtures for the general case where the number of sensors are greater than or equal to the number of sources. We assume that sources are non-stationary signals. The separation is performed in the frequency domain by joint minimization of the off–diagonal elements of observed signal’s cross-spectral density matrices over diff...

متن کامل

Blind Source Separation: a Partial Joint Diagonalization (pajod) Approach

Blind Separation of convolutive mixtures and Blind Equalization of Multiple-Input Multiple-Output (MIMO) channels are two different ways of naming the same problem, which we address here. A novel MIMO optimization criterion, subsequently presented in this paper, consists of a Partial Approximate Joint Diagonalization (PAJOD) of several matrices, containing some values of output cumulant multi-c...

متن کامل

Convolutive Blind Source Separation for Noisy Mixtures

The problem of separating convolutive mixtures of unknown time series arises in several application domains, a prominent example being the so-called cocktail party problem, where we want to recover the speech signals of multiple speakers who are simultaneously talking in a room. The room may be reverberant due to reflections on the walls, i.e., the original source signals sq(n), q = 1, . . . , ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004